Single-machine scheduling to minimize total absolute differences in waiting times with deteriorating jobs

نویسندگان

  • Linhui Sun
  • Linyan Sun
  • Ji-Bo Wang
چکیده

Single-machine scheduling to minimize total absolute differences in waiting times with deteriorating jobs L-H Sun1,2,3, L-Y Sun3,4,5 and J-B Wang2,6∗ 1School of Business Administration, Xi’an University of Technology, Xi’an, People’s Republic of China; 2Knowledge Management & Innovation Research Centre, Xi’an Jiaotong University, Xi’an, People’s Republic of China; 3The State Key Laboratory on Mechanic Manufacturing, Xi’an Jiaotong University, Xi’an, People’s Republic of China; 4Management School, Xi’an Jiaotong University, Xi’an, People’s Republic of China; 5The Key Laboratory of the Ministry of Education on Process Control and Efficiency, Xi’an Jiaotong University, Xi’an, People’s Republic of China; and 6Operations Research and Cybernetics Institute, School of Science, Shenyang Institute of Aeronautical Engineering, Shenyang, People’s Republic of China

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design of a Hybrid Genetic Algorithm for Parallel Machines Scheduling to Minimize Job Tardiness and Machine Deteriorating Costs with Deteriorating Jobs in a Batched Delivery System

This paper studies the parallel machine scheduling problem subject to machine and job deterioration in a batched delivery system. By the machine deterioration effect, we mean that each machine deteriorates over time, at a different rate. Moreover, job processing times are increasing functions of their starting times and follow a simple linear deterioration. The objective functions are minimizin...

متن کامل

GENETIC AND TABU SEARCH ALGORITHMS FOR THE SINGLE MACHINE SCHEDULING PROBLEM WITH SEQUENCE-DEPENDENT SET-UP TIMES AND DETERIORATING JOBS

 This paper introduces the effects of job deterioration and sequence dependent set- up time in a single machine scheduling problem. The considered optimization criterion is the minimization of the makespan (Cmax). For this purpose, after formulating the mathematical model, genetic and tabu search algorithms were developed for the problem. Since population diversity is a very important issue in ...

متن کامل

Single Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs

This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...

متن کامل

Single-machine scheduling with past-sequence-dependent delivery times and deteriorating jobs

This paper addresses some single-machine scheduling problems with past-sequence-dependent (p-s-d) delivery times and deteriorating jobs. By the past-sequence-dependent (p-s-d) delivery times, we mean that the delivery time of any job is proportional to the job’s waiting time. It is assumed that the deterioration process reflects a increase in the process time as a function of the job’s starting...

متن کامل

Unrelated Parallel-Machine Scheduling Problems with General Truncated Job-Dependent Learning Effect

In this paper, we consider scheduling problems with general truncated job-dependent learning effect on unrelated parallel-machine. The objective functions are to minimize total machine load, total completion (waiting) time, total absolute differences in completion (waiting) times respectively. If the number of machines is fixed, these problems can be solved in m O n 2 ( ) + time respectively, w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JORS

دوره 62  شماره 

صفحات  -

تاریخ انتشار 2011